Observations on the shortest independent loop set algorithm
نویسندگان
چکیده
منابع مشابه
A note on the random greedy independent set algorithm
Let r be a fixed constant and let H be an r-uniform, D-regular hypergraph on N vertices. Assume further that D > N ǫ for some ǫ > 0. Consider the random greedy algorithm for forming an independent set in H. An independent set is chosen at random by iteratively choosing vertices at random to be in the independent set. At each step we chose a vertex uniformly at random from the collection of vert...
متن کاملAn Optimal Algorithm to Find Maximum Independent Set and Maximum 2-Independent Set on Cactus Graphs
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find a maximum independent set and maximum 2-independent set on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
متن کاملEngineering a New Loop-Free Shortest Paths Routing Algorithm
We present LFR (Loop Free Routing), a new loop-free distance vector routing algorithm, which is able to update the shortest paths of a distributed network with n nodes in fully dynamic scenarios. If Φ is the total number of nodes affected by a set of updates to the network, and φ is the maximum number of destinations for which a node is affected, then LFR requires O(Φ ·∆) messages and O(n+φ ·∆)...
متن کاملA Shortest Antecedent Set Algorithm for Mining Association Rules*
Aiming at the redundancy problem of association rules in the mining process of mining association rules, a kind of shortest antecedent set algorithm (SASA) for mining association rules is proposed in this paper, and the algorithm is supported by the set-enumeration tree structure. The proposed algorithm is able to record a kind of subset for association rules without any information loss, and t...
متن کاملA Parallel Maximal Independent Set Algorithm
The parallel construction ofmaximal independent sets is a useful building block for many algorithms in the computational sciences, including graph coloring and multigrid coarse grid creation on unstructured meshes. We present an e cient asynchronous maximal independent set algorithm for use on parallel computers, for \well partitioned" graphs, that arise from nite element (FE) models. For appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: System Dynamics Review
سال: 2012
ISSN: 0883-7066
DOI: 10.1002/sdr.1477